Condorcet Consistent Bundling with Social Choice
نویسندگان
چکیده
We study the problem of computing optimal bundles given agents’ preferences over individual items when agents derive satisfaction from the entire bundle under constraints on the size k of the bundle. Building on the notion of Condorcet winning sets by Gehrlein [16], we extend common Condorcet consistent voting rules from the single winner voting setting to that of forming bundles of size k. Our main technical contribution involves designing efficient algorithms for computing (approximately)-optimal bundles for multiwinner extensions of the following voting rules: Copeland, Minimax, Ranked Pairs, and Schulze.
منابع مشابه
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type
The main idea of the distance rationalizability approach to view the voters’ preferences as an imperfect approximation to some kind of consensus is deeply rooted in social choice literature. It allows one to define (“rationalize”) voting rules via a consensus class of elections and a distance: a candidate is said to be an election winner if she is ranked first in one of the nearest (with respec...
متن کاملPositional rules and q-Condorcet consistency
A well-known result in Social Choice theory is the following: every scoring rule (positional rules) violates Condorcet consistency. A rule is Condorcet consistent when it selects the alternative that is preferred to every other alternative by a majority of individuals. In this paper, we investigate some limits of this negative result. We expose the relationship between a weaker version of the C...
متن کاملIncorporating Reality into Social Choice
When voting on a proposal one in fact chooses between two alternatives: (i) A new hypothetical social state depicted by the proposal and (ii) the status quo (henceforth: Reality); a Yes vote favors a transition to the proposed hypothetical state, while a No vote favors Reality. Social Choice theory generalizes voting on one proposal to ranking multiple proposals; that Reality was forsaken durin...
متن کاملThe Condorcet paradox revisited
We analyze the simplest Condorcet cycle with three players and three alternatives within a strategic bargaining model with recognition probabilities and costless delay. Mixed consistent subgame perfect equilibria exist whenever the geometric mean of the agents’ risk coefficients, ratios of utility differences between alternatives, is at most one. Equilibria are generically unique, Pareto effici...
متن کاملPlurality Mechanisms, Virtual Implementation, and Condorcet-Decisiveness
We investigate implementation of social choice functions as mappings from states to lotteries under complete information. We assume that for every agent, any pair of distinct states induces distinct preferences. A social choice function is called Condorcet-decisive if it always enforces the Condorcet winner among its range. We introduce plurality mechanisms, where each agent makes a single anno...
متن کامل